Domain Specific Search by Ranking Model Adaptation Using Binary Classifier
نویسنده
چکیده
Domain specific search focus on one area of knowledge. Applying broad based ranking algorithm to vertical search domains is not desirable. Broad based ranking model is built upon the data from multiple domains Vertical search engines use a focused crawler that attempts to index only relevant web pages to a pre defined topic. With Ranking Adaptation Model we can adapt an existing ranking model to a new domain. Binary classifiers classify the members of a given set of objects into two groups on the basis of whether they have some property or not.
منابع مشابه
Adapting a Ranking Model for Domain-Specific Search
An adaptation process is described to adapt a ranking model constructed for a broad-based search engine for use with a domain-specific ranking model. It’s difficult to applying the broad-based ranking model directly to different domains due to domain differences, to build a unique ranking model for each domain it time-consuming for training models. In this paper,we address these difficulties by...
متن کاملSample-oriented Domain Adaptation for Image Classification
Image processing is a method to perform some operations on an image, in order to get an enhanced image or to extract some useful information from it. The conventional image processing algorithms cannot perform well in scenarios where the training images (source domain) that are used to learn the model have a different distribution with test images (target domain). Also, many real world applicat...
متن کاملRanking Adaptation Svm for Target Domain Search
With the growth of different search engines, it becomes difficult for an user to search particular information effectively. If a search engine could provide domain specific information such as that confines only to a particular topicality, it is referred to as domain specific engine. Applying the ranking model trained for broad-based search to a domain specific search does not achieve good perf...
متن کاملCross-Market Model Adaptation with Pairwise Preference Data for Web Search Ranking
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this p...
متن کاملAn Ensemble Click Model for Web Document Ranking
Annually, web search engine providers spend more and more money on documents ranking in search engines result pages (SERP). Click models provide advantageous information for ranking documents in SERPs through modeling interactions among users and search engines. Here, three modules are employed to create a hybrid click model; the first module is a PGM-based click model, the second module in a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014